Belief Change and Semiorders
نویسندگان
چکیده
A central result in the AGM framework for belief revision is the construction of revision functions in terms of total preorders on possible worlds. These preorders encode comparative plausibility: r ă r1 states that the world r is at least as plausible as r1. Indifference in the plausibility of two worlds, r, r1, denoted r „ r1, is defined as r ⊀ r1 and r1 ⊀ r. Herein we take a closer look at plausibility indifference. We contend that the transitivity of indifference assumed in the AGM framework is not always a desirable property for comparative plausibility. Our argument originates from similar concerns in preference modelling, where a structure weaker than a total preorder, called a semiorder, is widely consider to be a more adequate model of preference. In this paper we essentially re-construct revision functions using semiorders instead of total preorders. We formulate postulates to characterise this new, wider, class of revision functions, and prove that the postulates are sound and complete with respect to the semiorder-based construction. The corresponding class of contraction functions (via the Levi and Harper Identities) is also characterised
منابع مشابه
Inductive Characterizations of Finite Interval Orders and Semiorders
We introduce an inductive definition for two classes of orders. By simple proofs, we show that one corresponds to the interval orders class and that the other is exactly the semiorders class. To conclude we consider most of the known equivalence theorems on interval orders and on semiorders, and we give simple and direct inductive proofs of these equivalences with ours characterizations.
متن کاملSemiorders with separability properties
We analyze different separability conditions that characterize the numerical representability of semiorders through a real-valued function and a strictly positive threshold. Any necessary and sufficient condition for the numerical representability of an interval order by means of two real-valued functions is proved to also characterize the Scott–Suppes representability of semiorders provided th...
متن کاملBi-semiorders with frontiers on finite sets
This paper studies an extension of bi-semiorders in which a “frontier” is added between the various relations used. This extension is motivated by the study of additive representations of ordered partitions and coverings defined on product sets of two components.
متن کاملSemiorders and Riordan Numbers
In this paper, we define a class of semiorders (or unit interval orders) that arose in the context of polyhedral combinatorics. In the first section of the paper, we will present a pure counting argument equating the number of these interesting (connected and irredundant) semiorders on n + 1 elements with the nth Riordan number. In the second section, we will make explicit the relationship betw...
متن کاملNumerical Representation of Semiorders
We introduce a codomain to represent semiorders, total preorders and interval orders by means of a single map. We characterize the semiorders that are representable in the extended real line.
متن کامل